Dynamic Cluster Assignment Mechanisms
نویسندگان
چکیده
Clustered microarchitectures are an effective approach to reducing the penalties caused by wire delays inside a chip. Current superscalar processors have in fact a two-cluster microarchitecture with a naive code partitioning approach: integer instructions are allocated to one cluster and floating-point instructions to the other. This partitioning scheme is simple and results in no communications between the two clusters (just through memory) but it is in general far from optimal because the workload is not evenly distributed most of the time. In fact, when the processor is running integer programs, the workload is extremely unbalanced since the FP cluster is not used at all. In this work we investigate run-time mechanisms that dynamically distribute the instructions of a program among these two clusters. By optimizing the trade-off between inter-cluster communication penalty and workload balance, the proposed schemes can achieve an average speed-up of 36% for the SpecInt95 benchmark suite.
منابع مشابه
Cluster Assignment Strategies for a Clustered Trace Cache Processor
This report examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed clustering techniques run into unique problems as issue width and cluster count increase. Realistic design conditions, such as variable data forwarding latencies between clusters and a heavily partitioned instruction window also increase the degree of difficulty for effective cluste...
متن کاملLiterature Review of Traffic Assignment: Static and Dynamic
Rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. In the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. With traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. Four s...
متن کاملMinimisation of the Average Response Time in a Cluster of Servers
In this paper, we consider task assignment problem in a cluster of servers. We show that optimal static task assignment is tantamount to equalizing an appropriate cost functions associated with the servers. We also propose an improvement of dynamic Shortest Expected Delay (SED) task assignment policy.
متن کاملMolecular Dynamics Simulation of Al Energetic Nano Cluster Impact (ECI) onto the Surface
On the atomic scale, Molecular Dynamic (MD) Simulation of Nano Al cluster impact on Al (100) substrate surface has been carried out for energies of 1-20 eV/atom to understand quantitatively the interaction mechanisms between the cluster atoms and the substrate atoms. The many body Embedded Atom Method (EAM) was used in this simulation. We investigated the maximum substrate temperature Tmax and...
متن کاملAn efficient cluster-based CDMA/TDMA scheme for wireless mobile ad-hoc networks: A learning automata approach
In this paper, we design a dynamic frame length CDMA/TDMA scheme for clustered wireless ad hoc networks with unknown traffic parameters. In this scheme, the collision-free intra-cluster communications are organized by the cluster-heads using a TDMA scheme, and a CDMA scheme is overlaid on the TDMA to organize the interference-free inter-cluster communications. Therefore, to design such a scheme...
متن کاملUpper and lower bounds for dynamic cluster assignment for multi-target tracking in heterogeneous WSNs
In this paper, we consider the problem of cluster task assignment to maximize total utilities of nodes for target coverage in heterogeneous Wireless Sensor Networks. We define this problem as assigning the tasks of Cluster Head (CH) and Cluster Members (CM) to nodes for each target and requiring communication connectivity between every CHwith its members. The utility of each node for each targe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000